Towards Revenue Maximization with Popular and Profitable Products

نویسندگان

چکیده

Economic-wise, a common goal for companies conducting marketing is to maximize the return revenue/profit by utilizing various effective strategies. Consumer behavior crucially important in economy and targeted marketing, which behavioral economics can provide valuable insights identify biases profit from customers. Finding credible reliable information on products’ profitability is, however, quite difficult since most products tend peak at certain times w.r.t. seasonal sales cycles year. On-Shelf Availability (OSA) plays key factor performance evaluation. Besides, staying ahead of hot product trends means we increase efforts without selling out inventory. To fulfill this gap, paper, first propose general profit-oriented framework address problem revenue maximization based economic behavior, compute O n-shelf P opular rofitable roducts (OPPPs) marketing. tackle problem, model k-satisfiable concept an algorithmic searching OPPP its variants. Extensive experiments are conducted several real-world datasets evaluate effectiveness efficiency proposed algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Item-Basket Revenue Maximization

Setting prices for items is difficult because one needs to look at prices other substitutable as well as complimentary items. In a co-purchasing network, co-occurence of items can be exploited to tweak item prices for revenue maximization. In our report, we investigate the effects of co-occurrence of items on their prices. In general this problem seems to be NP-Hard. We propose heuristics based...

متن کامل

X Revenue Maximization with Nonexcludable Goods

We consider the design of revenue maximizing auctions for nonexcludable public goods. In particular, we consider auctions in Bayesian settings for facility location problems on graphs. Edges represent sites for facilities (e.g., roads, communication links) to be constructed. Each agent represents a pair of nodes in the graph, and he derives some nonnegative private value drawn from a known dist...

متن کامل

Revenue Maximization via Nash Implementation

We consider the problem of maximizing revenue in prior-free auctions for general single parameter settings. The setting is modeled by an arbitrary downward-closed set system, which captures many special cases such as single item, digital goods and single-minded combinatorial auctions. We relax the truthfulness requirement by the solution concept of Nash equilibria. Implementation by Nash equili...

متن کامل

Sampling and Representation Complexity of Revenue Maximization

We consider (approximate) revenue maximization in auctions where the distribution on input valuations is given via “black box” access to samples from the distribution. We observe that the number of samples required – the sample complexity – is tightly related to the representation complexity of an approximately revenue-maximizing auction. Our main results are upper bounds and an exponential low...

متن کامل

Auctions with Dynamic Populations: Efficiency and Revenue Maximization

We study indirect mechanisms in a setting where both objects and privatelyinformed buyers arrive stochastically to a market. The seller in this setting faces a sequential allocation problem, and must elicit the private information of the dynamic population of buyers in order to achieve her desired outcome—either an efficient or a revenuemaximizing allocation. We propose a simple indirect mechan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM/IMS transactions on data science

سال: 2021

ISSN: ['2691-1922', '2577-3224']

DOI: https://doi.org/10.1145/3488058